@Article{FialhoMort:2017:PeTePy,
               author = "Fialho, M{\'a}rcio Afonso Arimura and Mortari, Daniele",
          affiliation = "{Instituto Nacional de Pesquisas Espaciais (INPE)} and {Texas A 
                         \& M University}",
                title = "Performance tests of pyramid star-ID algorithm with memory 
                         adaptive K-vector",
              journal = "Advances in the Astronautical Sciences",
                 year = "2017",
               volume = "160",
                pages = "2473--2754",
                 note = "27th AAS/AIAA Space Flight Mechanics Meeting, 2017; San Antonio; 
                         United States; 05-09 Feb. 2017.",
             abstract = "This paper presents results obtained with a C/C++ implementation 
                         of the Pyramid star identification algorithm enhanced by the 
                         memory adaptive k-vector. Specifically, the paper focuses in the 
                         benchmark results of Pyramid run time versus the amount of memory 
                         allocated for the k-vector. A discussion about the tradeoff 
                         relations between memory allocated for the k-vector and speed, and 
                         the impact of cache misses in modern processors for very long 
                         k-vectors is presented.",
                 issn = "0065-3438.",
             language = "en",
        urlaccessdate = "27 abr. 2024"
}